A nontransitive, fully transitive primary group
نویسندگان
چکیده
منابع مشابه
The transitive core: inference of welfare from nontransitive preference relations
This paper studies welfare criteria under an environment in which a decision maker is endowed with a nontransitive preference relation. In such an environment, the classical utilitarian welfare criterion may not identify the welfare order, and the problem of maximizing the decision maker’s welfare becomes ambiguous. In order to find a criterion that applies to nontransitive preference relations...
متن کاملTransitive Group Actions
Every action of a group on a set decomposes the set into orbits. The group acts on each of the orbits and an orbit does not have sub-orbits (unequal orbits are disjoint), so the decomposition of a set into orbits could be considered as a “factorization” of the set into “irreducible” pieces for the group action. Our focus here is on these irreducible parts, namely group actions with a single orbit.
متن کاملFully Dynamic Biconnectivity and Transitive Closure
This paper presents an algorithm for the fully dynamic biconnectivity problem whose running time i s exponentially faster than all previously known solutions. It is the first dynamic algorithm that answers biconnectivity queries in time O(log2n) in a n-node graph and can be updated after an edge insertion or deletion in polylogarithmic time. Our algorithm is a LasVegas style randomized algorith...
متن کاملFully primary modules and some variations
Let R be a commutative ring and M be an R-module. We say that M is fully primary, if every proper submodule of M is primary. In this paper, we state some characterizations of fully primary modules. We also give some characterizations of rings over which every module is fully primary, and of those rings over which there exists a faithful fully primary module. Furthermore, we will introduce some ...
متن کاملA Game of Nontransitive Dice
We consider a two player simultaneous-move game where the two players each select any permissible n-sided die for a fixed integer n. A player wins if the outcome of his roll is greater than that of his opponent. Remarkably, for n > 3, there is a unique Nash Equilibrium in pure strategies. The unique Nash Equilibrium is for each player to throw the Standard n-sided die, where each side has a dif...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebra
سال: 1969
ISSN: 0021-8693
DOI: 10.1016/0021-8693(69)90118-5